Finding and enumerating large intersections
نویسندگان
چکیده
منابع مشابه
Finding and enumerating large intersections
We study the calculation of the largest pairwise intersections in a given set family. We give combinatorial and algorithmic results both for the worst case and for set families where the frequencies of elements follow a power law, as words in texts typically do. The results can be used in faster preprocessing routines in a simple approach to multi-document summarization.
متن کاملGeometric Motion Planning: Finding Intersections
We investigate a new model for mobile agents: Motion planning with geometric primitives, similar to rulerand-circle constructions in classical geometry. In this first paper on this subject, we consider finding intersection points between two geometric objects using mobile agents that move on these objects. This amounts to finding the rendezvous point of the two agents.
متن کاملEnumerating Infeasibility: Finding Multiple MUSes Quickly
Methods for analyzing infeasible constraint sets have proliferated in the past decade, commonly focused on finding maximal satisfiable subsets (MSSes) or minimal unsatisfiable subsets (MUSes). Most common are methods for producing a single such subset (one MSS or one MUS), while a few algorithms have been presented for enumerating all of the interesting subsets of a constraint set. In the case ...
متن کاملEnumerating Large Orbits and Direct Condensation
We describe a new implementation of direct condensation, which is a tool in computational representation theory. The crucial point for this is the enumeration of very large orbits for a group acting on some set. We present a variation of the standard orbit enumeration algorithm that reduces the amount of storage needed and behaves well under parallelization. For the special case of matrices act...
متن کاملFinding Pairwise Intersections of Rectangles in a Query Rectangle
We consider the following problem: Preprocess a set S of n axis-parallel boxes in R so that given a query of an axis-parallel box in R, the pairs of boxes of S whose intersection intersects the query box can be reported efficiently. For the case that d = 2, we present a data structure of size O(n log n) supporting O(log n+ k) query time, where k is the size of the output. This improves the prev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.02.034